package queue;

import java.util.Iterator;

public class LinkedListDeQueue<E> implements DeQueue,Iterable<E>{
    class Node{
        Node prev;
        E val;
        Node next;

        public Node(Node prev, E val, Node next) {
            this.prev = prev;
            this.val = val;
            this.next = next;
        }
    }
    @Override
    public Iterator<E> iterator() {
        return null;
    }

    @Override
    public boolean offerFirst(Object o) {
        return false;
    }

    @Override
    public boolean offerLast(Object o) {
        return false;
    }

    @Override
    public Object pollFirst(Object o) {
        return null;
    }

    @Override
    public Object pollLast(Object o) {
        return null;
    }

    @Override
    public Object peekFirst(Object o) {
        return null;
    }

    @Override
    public Object peekLast(Object o) {
        return null;
    }

    @Override
    public boolean isEmpty() {
        return false;
    }

    @Override
    public boolean isFull() {
        return false;
    }
}
